In Proceedings of International Conference on Artificial Neural Networks ( ICANN ’ 96 )

Bochum, Germany, pages 899 904, 1996. Con uent Preorder Parser As A Finite State Automata HO, Kei Shiu Edward CHAN, Lai Wan Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong email: [email protected], [email protected] Abstract. We present the Con uent Preorder Parser (CPP) in which syntactic parsing is achieved via a holistic transformation from the sentence representation to the desired parse tree representation. Simulation results show that CPP has achieved excellent generalization performance and is capable of handling erroneous sentences and resolving syntactic ambiguities. An analysis is presented which elucidates the operations of CPP as governed by a nite state automata. The parsing is interpreted as a series of decision makings during the process. Based on this formalism, syntactic parsing and generalization by CPP can be explained in terms of state transitions.